`On a Tracking Scheme with Probabilistic Completeness for a Distributed Sensor Network

A framework and analysis for a distributed sensor network based surveillance system is presented here. In a previous effort [1] we have presented methodologies for coordination and decision-making amongst sensors for tracking targets while in [2] we presented the results of endowing the sensor network with autonomy. Sensors monitor targets that crisscross a rectangular surveillance zone. When a sensor pursuits a target it leaves areas unguarded through which other targets can get past undetected. In this paper we presents a methodology that computes the tracking time for a sensor that guarantee detection of a required fraction of the targets expected to crisscross its home area to an arbitrary probabilistic threshold. The home area of the sensor is the area guarded by it when it is stationed at its home position, its default position when it is not in pursuit of a target. Simulations are presented that corroborate with the probabilistic model developed and hence vindicate its correctness. A framework for extending the probabilistic model to a system where multiple sensors guard the same area is also presented.